منابع مشابه
Finding Minimum Generators of Path Systems'
A simple algorithmic proof of a min-max theorem of E. Gy} ori on generators of path systems is described. The algorithm relies on Dilworth's theorem.
متن کاملFinding minimum weighted generators of a path system
In a recent paper the author 1997a] described a short algorithmic proof of a min-max theorem of E. Gy} ori 1984] on minimum generators of a system of subpaths of an underlying path. A. Frank and T. Jordd an 1995] generalized Gy} ori's theorem in several ways; the underlying path was replaced by a circuit, generators were extended to weighted generators, and minimum cost generators were also tre...
متن کاملFinding the Minimum-Weight k-Path
Given a weighted n-vertex graph G with integer edge-weights taken from a range [−M,M ], we show that the minimum-weight simple path visiting k vertices can be found in time Õ(2poly(k)Mn) = O∗(2kM). If the weights are reals in [1,M ], we provide a (1+ε)-approximation which has a running time of Õ(2poly(k)n(log logM + 1/ε)). For the more general problem of k-tree, in which we wish to find a minim...
متن کاملA Branch and Bound Method for Finding Flow Path Designing of Agv Systems (RESEARCH NOTE)
One of the important factor in the design of automated guided vehicle systems (AGVS) is the flow path design. This paper presents a branch-and-bound algorithm to determining the flow path by considering not only loaded-vehicles, but also empty-vehicles. The objective is to find the flow path, which will minimize total travel of loaded vehicles. We know that in branch-and-bound method a branch c...
متن کاملOptimization-Based String Method for Finding Minimum Energy Path
We present an efficient algorithm for calculating the minimum energy path (MEP) and energy barriers between local minima on a multidimensional potential energy surface (PES). Such paths play a central role in the understanding of transition pathways between metastable states. Our method relies on the original formulation of the string method [Phys. Rev. B, 66, 052301 (2002)], i.e. to evolve a s...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Combinatorial Theory, Series B
سال: 1999
ISSN: 0095-8956
DOI: 10.1006/jctb.1998.1877